Rapid Mixing of Dynamic Graphs With Local Evolution Rules
نویسندگان
چکیده
منابع مشابه
Rapid Mixing of Local Graph Dynamics
Graph dynamics arise naturally in many contexts. For instance in peer-to-peer networks, a participating peer may replace an existing connection with one neighbour by a new connection with a neighbour’s neighbour. Several such local rewiring rules have been proposed to ensure that peer-to-peer networks achieve good connectivity properties (e.g. high expansion) in equilibrium. However it has rema...
متن کاملDetermination of Minimum Miscibility Pressure in Gas Injection Process by Using ANN with Various Mixing Rules
Miscible gas injection is one of the most effective enhanced oil recovery techniques and minimum miscibility pressure (MMP) is an important parameter in miscible gas injection processes. The accurate determination of this parameter is critical for an adequate design of injection equipment investment prospect. The purpose of this paper is to develop a new universal artificial neural network (U-A...
متن کاملNew Local Composition-Equation of State Mixing Rules for High Pressure Vapor-Liquid Equilibria Using EOS/AE
In this study using Equation of State/ Helmholtz excess energy function, EOS/AE, two new local composition-Equation-of State mixing rules, LCEOS1 and LCEOS2 were developed in which the energy interaction parameters were expressed in terms of attractive and repulsive parameters of the cubic equation of state. The EOS/AE models are applied for equilibrium calculation of nat...
متن کاملDiscovering Inter-Dimensional Rules in Dynamic Graphs
Data mining methods that exploit graph/network have become quite popular and a timely challenge is to consider the discovery of dynamic properties in evolving graphs or networks. In this paper, we consider the dynamic oriented graphs that can be encoded as n-ary relations with n ≥ 3 such that we have a least 3 dimensions: the dimensions of departure (tail) and arrival (head) vertices plus the t...
متن کاملDiscovering descriptive rules in relational dynamic graphs
Graph mining methods have become quite popular and a timely challenge is to discover dynamic properties in evolving graphs or networks. We consider the so-called relational dynamic oriented graphs that can be encoded as n-ary relations with n 3 and thus represented by Boolean tensors. Two dimensions are used to encode the graph adjacency matrices and at least one other denotes time. We design t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2020
ISSN: 2327-4697,2334-329X
DOI: 10.1109/tnse.2019.2926887